TSTP Solution File: CSR136^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 21:07:10 EDT 2023
% Result : Theorem 0.37s 0.56s
% Output : Proof 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n023.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Aug 28 14:10:25 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 %----Proving TH0
% 0.37/0.54 %------------------------------------------------------------------------------
% 0.37/0.54 % File : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% 0.37/0.54 % Domain : Commonsense Reasoning
% 0.37/0.54 % Problem : What's a common feeling of Sue and Mary to Bill?
% 0.37/0.54 % Version : Especial.
% 0.37/0.54 % English : Does there exists a relation ?R that holds between Sue and Bill
% 0.37/0.54 % as well as between Mary and Bill?
% 0.37/0.54
% 0.37/0.54 % Refs : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.37/0.54 % Source : [Ben10]
% 0.37/0.54 % Names : rv_2.tq_SUMO_local [Ben10]
% 0.37/0.54
% 0.37/0.54 % Status : Theorem
% 0.37/0.54 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.00 v6.2.0, 0.17 v6.1.0, 0.50 v6.0.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.1.0
% 0.37/0.54 % Syntax : Number of formulae : 18 ( 8 unt; 9 typ; 0 def)
% 0.37/0.54 % Number of atoms : 10 ( 0 equ; 2 cnn)
% 0.37/0.54 % Maximal formula atoms : 2 ( 1 avg)
% 0.37/0.54 % Number of connectives : 28 ( 2 ~; 0 |; 2 &; 24 @)
% 0.37/0.54 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.37/0.54 % Maximal formula depth : 9 ( 4 avg)
% 0.37/0.54 % Number of types : 3 ( 1 usr)
% 0.37/0.54 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.37/0.54 % Number of symbols : 9 ( 8 usr; 7 con; 0-2 aty)
% 0.37/0.54 % Number of variables : 3 ( 0 ^; 2 !; 1 ?; 3 :)
% 0.37/0.54 % SPC : TH0_THM_NEQ_NAR
% 0.37/0.54
% 0.37/0.54 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.37/0.54 % Initally the problem has been hand generated in KIF syntax in
% 0.37/0.54 % SigmaKEE and then automatically translated by Benzmueller's
% 0.37/0.54 % KIF2TH0 translator into THF syntax.
% 0.37/0.54 % : The translation has been applied in two modes: local and SInE.
% 0.37/0.54 % The local mode only translates the local assumptions and the
% 0.37/0.54 % query. The SInE mode additionally translates the SInE-extract
% 0.37/0.54 % of the loaded knowledge base (usually SUMO).
% 0.37/0.54 % : The examples are selected to illustrate the benefits of
% 0.37/0.54 % higher-order reasoning in ontology reasoning.
% 0.37/0.54 % : Note the universal predicate is excluded for ?R with the second
% 0.37/0.54 % conjunct in the query.
% 0.37/0.54 %------------------------------------------------------------------------------
% 0.37/0.54 %----The extracted signature
% 0.37/0.54 thf(numbers,type,
% 0.37/0.54 num: $tType ).
% 0.37/0.54
% 0.37/0.54 thf(lAnna_THFTYPE_i,type,
% 0.37/0.54 lAnna_THFTYPE_i: $i ).
% 0.37/0.54
% 0.37/0.54 thf(lBen_THFTYPE_i,type,
% 0.37/0.54 lBen_THFTYPE_i: $i ).
% 0.37/0.54
% 0.37/0.54 thf(lBill_THFTYPE_i,type,
% 0.37/0.54 lBill_THFTYPE_i: $i ).
% 0.37/0.54
% 0.37/0.54 thf(lBob_THFTYPE_i,type,
% 0.37/0.54 lBob_THFTYPE_i: $i ).
% 0.37/0.54
% 0.37/0.54 thf(lMary_THFTYPE_i,type,
% 0.37/0.54 lMary_THFTYPE_i: $i ).
% 0.37/0.54
% 0.37/0.54 thf(lSue_THFTYPE_i,type,
% 0.37/0.54 lSue_THFTYPE_i: $i ).
% 0.37/0.54
% 0.37/0.54 thf(likes_THFTYPE_IiioI,type,
% 0.37/0.54 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.37/0.54
% 0.37/0.54 thf(parent_THFTYPE_IiioI,type,
% 0.37/0.54 parent_THFTYPE_IiioI: $i > $i > $o ).
% 0.37/0.54
% 0.37/0.54 %----The translated axioms
% 0.37/0.54 thf(ax,axiom,
% 0.37/0.54 likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 thf(ax_001,axiom,
% 0.37/0.54 (~) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ).
% 0.37/0.54
% 0.37/0.54 thf(ax_002,axiom,
% 0.37/0.54 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 thf(ax_003,axiom,
% 0.37/0.54 parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 thf(ax_004,axiom,
% 0.37/0.54 parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 thf(ax_005,axiom,
% 0.37/0.54 likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 thf(ax_006,axiom,
% 0.37/0.54 parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 thf(ax_007,axiom,
% 0.37/0.54 parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i ).
% 0.37/0.54
% 0.37/0.54 %----The translated conjecture
% 0.37/0.54 thf(con,conjecture,
% 0.37/0.54 ? [R: $i > $i > $o] :
% 0.37/0.54 ( ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
% 0.37/0.54 & ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
% 0.37/0.54 & ( (~)
% 0.37/0.54 @ ! [A: $i,B: $i] : ( R @ A @ B ) ) ) ).
% 0.37/0.54
% 0.37/0.54 %------------------------------------------------------------------------------
% 0.37/0.54 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.V47rdx2qnO/cvc5---1.0.5_30126.p...
% 0.37/0.54 (declare-sort $$unsorted 0)
% 0.37/0.54 (declare-sort tptp.num 0)
% 0.37/0.54 (declare-fun tptp.lAnna_THFTYPE_i () $$unsorted)
% 0.37/0.54 (declare-fun tptp.lBen_THFTYPE_i () $$unsorted)
% 0.37/0.54 (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.37/0.56 (declare-fun tptp.lBob_THFTYPE_i () $$unsorted)
% 0.37/0.56 (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.37/0.56 (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.37/0.56 (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.37/0.56 (declare-fun tptp.parent_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.37/0.56 (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.37/0.56 (assert (not (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lMary_THFTYPE_i)))
% 0.37/0.56 (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.37/0.56 (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBen_THFTYPE_i))
% 0.37/0.56 (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBen_THFTYPE_i))
% 0.37/0.56 (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.37/0.56 (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lAnna_THFTYPE_i))
% 0.37/0.56 (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lAnna_THFTYPE_i))
% 0.37/0.56 (assert (not (exists ((R (-> $$unsorted $$unsorted Bool))) (and (@ (@ R tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ R tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) (not (forall ((A $$unsorted) (B $$unsorted)) (@ (@ R A) B)))))))
% 0.37/0.56 (set-info :filename cvc5---1.0.5_30126)
% 0.37/0.56 (check-sat-assuming ( true ))
% 0.37/0.56 ------- get file name : TPTP file name is CSR136^1
% 0.37/0.56 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_30126.smt2...
% 0.37/0.56 --- Run --ho-elim --full-saturate-quant at 10...
% 0.37/0.56 % SZS status Theorem for CSR136^1
% 0.37/0.56 % SZS output start Proof for CSR136^1
% 0.37/0.56 (
% 0.37/0.56 (let ((_let_1 (not (exists ((R (-> $$unsorted $$unsorted Bool))) (and (@ (@ R tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ R tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) (not (forall ((A $$unsorted) (B $$unsorted)) (@ (@ R A) B)))))))) (let ((_let_2 (@ tptp.parent_THFTYPE_IiioI tptp.lMary_THFTYPE_i))) (let ((_let_3 (@ tptp.parent_THFTYPE_IiioI tptp.lSue_THFTYPE_i))) (let ((_let_4 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_5 (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i))) (let ((_let_6 (not (@ _let_5 tptp.lMary_THFTYPE_i)))) (let ((_let_7 (@ _let_5 tptp.lBill_THFTYPE_i))) (let ((_let_8 (forall ((BOUND_VARIABLE_662 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_623 $$unsorted) (BOUND_VARIABLE_621 $$unsorted)) (or (not (ho_4 (ho_3 BOUND_VARIABLE_662 tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i)) (not (ho_4 (ho_3 BOUND_VARIABLE_662 tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i)) (ho_4 (ho_3 BOUND_VARIABLE_662 BOUND_VARIABLE_621) BOUND_VARIABLE_623))))) (let ((_let_9 (ho_3 k_2 tptp.lSue_THFTYPE_i))) (let ((_let_10 (ho_4 _let_9 tptp.lMary_THFTYPE_i))) (let ((_let_11 (ho_4 (ho_3 k_2 tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_12 (not _let_11))) (let ((_let_13 (ho_4 _let_9 tptp.lBill_THFTYPE_i))) (let ((_let_14 (not _let_13))) (let ((_let_15 (or _let_14 _let_12 _let_10))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((R (-> $$unsorted $$unsorted Bool)) (BOUND_VARIABLE_623 $$unsorted) (BOUND_VARIABLE_621 $$unsorted)) (or (not (@ (@ R tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i)) (not (@ (@ R tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i)) (@ (@ R BOUND_VARIABLE_621) BOUND_VARIABLE_623))) _let_8))))))) (let ((_let_17 (not _let_15))) (let ((_let_18 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_19 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_20 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_21 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_16 :args (k_2 tptp.lMary_THFTYPE_i tptp.lSue_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args (_let_8))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_15)) :args ((or _let_10 _let_14 _let_12 _let_17))) (EQ_RESOLVE (ASSUME :args (_let_6)) (PREPROCESS :args ((= _let_6 (not _let_10))))) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_7)) (PREPROCESS :args ((= _let_7 _let_13)))) (PREPROCESS :args ((and _let_21 _let_20 _let_19 _let_18)))) :args ((and _let_13 _let_21 _let_20 _let_19 _let_18))) :args (0)) (EQ_RESOLVE (ASSUME :args (_let_4)) (PREPROCESS :args ((= _let_4 _let_11)))) :args (_let_17 true _let_10 false _let_13 false _let_11)) _let_16 :args (false true _let_15 false _let_8)) :args (_let_7 _let_6 _let_4 (@ _let_2 tptp.lBen_THFTYPE_i) (@ _let_3 tptp.lBen_THFTYPE_i) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ _let_3 tptp.lAnna_THFTYPE_i) (@ _let_2 tptp.lAnna_THFTYPE_i) _let_1 true))))))))))))))))))))))))
% 0.37/0.57 )
% 0.37/0.57 % SZS output end Proof for CSR136^1
% 0.37/0.57 % cvc5---1.0.5 exiting
% 0.37/0.57 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------